#include <bits/stdc++.h>
using namespace std;

#define int int64_t
#define endl "\n"

using PII = pair<int, int>;
using TII = tuple<int, int, int>;
template<class T> using V = vector<T>;
using i64 = long long;
using i128 = __int128;
using u64 = unsigned long long;

#define FOR(i, a, b) for (int i = (int)(a); i <= (int)(b); i++)
#define FOR2(i, a, b, c) for (int i = (int)(a); i <= (int)(b); i += c)
#define FORD(i, b, a) for (int i = (int)(a); i >= (int)(b); i--)
#define FORD2(i, b, a, c) for (int i = (int)(a); i >= (int)(b); i -= c)
#define ALL(a) a.begin(), a.end()
#define RALL(a) a.rbegin(), a.rend()
#define lowbit(x) ((x) & (-x))
#define RE return;
#define Yes cout << "Yes" << endl;
#define YES cout << "YES" << endl;
#define No cout << "No" << endl;
#define NO cout << "NO" << endl;
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define sz(x) (int)(x).size()

void solve() {
    int n;
    cin >> n;
    int tot = (1 << n);
    V<int> w(tot + 1, 0);
    FOR(i, 1, tot) cin >> w[i];

    V<int> ans(tot + 1, 0);

    function<void(int, int)> dfs = [&](int l, int r) {
        if (l >= r) RE;

        int mid = (l + r) / 2;
        dfs(l, mid);
        dfs(mid + 1, r);

        if (w[l] > w[mid + 1]) {
            FOR(i, l, mid) {
                swap(w[i], w[i + (mid - l + 1)]);
            }
        }
    };

    dfs(1, tot);

    FOR(i, 1, tot) cout << w[i] << " \n"[i == tot];
}

signed main() {
    int Task = 1;

    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cin >> Task;
    while (Task--) {
        solve();
    }

    return 0;
}
